Yet Another Solution to the Burnside Problem for Matrix Semigroups
نویسنده
چکیده
We use the kernel category to give a finiteness condition for semigroups. As a consequence we provide yet another proof that finitely generated periodic semigroups of matrices are finite.
منابع مشابه
McCammond's normal forms for free aperiodic semigroups revisited
This paper revisits the solution of the word problem for ω-terms interpreted over finite aperiodic semigroups, obtained by J. McCammond. The original proof of correctness of McCammond’s algorithm, based on normal forms for such terms, uses McCammond’s solution of the word problem for certain Burnside semigroups. In this paper, we establish a new, simpler, correctness proof of McCammond’s algori...
متن کاملOn Semigroups of Matrices in the (max,+) Algebra
We show that the answer to the Burnside problem is positive for semigroups of matrices with entries in the (max;+)-algebra (that is, the semiring (R[ f 1g;max;+)), and also for semigroups of (max;+)-linear projective maps with rational entries. An application to the estimation of the Lyapunov exponent of certain products of random matrices is also discussed. Key-words: Semigroups, Burnside Prob...
متن کاملLinear plus fractional multiobjective programming problem with homogeneous constraints using fuzzy approach
We develop an algorithm for the solution of multiobjective linear plus fractional programming problem (MOL+FPP) when some of the constraints are homogeneous in nature. Using homogeneous constraints, first we construct a transformation matrix T which transforms the given problem into another MOL+FPP with fewer constraints. Then, a relationship between these two problems, ensuring that the solu...
متن کاملAn iterative method for the Hermitian-generalized Hamiltonian solutions to the inverse problem AX=B with a submatrix constraint
In this paper, an iterative method is proposed for solving the matrix inverse problem $AX=B$ for Hermitian-generalized Hamiltonian matrices with a submatrix constraint. By this iterative method, for any initial matrix $A_0$, a solution $A^*$ can be obtained in finite iteration steps in the absence of roundoff errors, and the solution with least norm can be obtained by choosing a special kind of...
متن کاملOn the Restricted Burnside Problem
After many unsuccessful attempts to obtain a proof in the late 30s-early 40s the following weaker version of The Burnside Problem was studied: Is it true that there are only finitely many 7??-generated finite groups of exponent nl In other words the question is whether there exists a universal finite m-generated group of exponent n having all other finite m-generated groups of exponent n as hom...
متن کامل